GUC-Secure Join Operator in Distributed Relational Database

نویسندگان

  • Yuan Tian
  • Hao Zhang
چکیده

Privacy-preserving SQL computation in distributed relational database is one of important applications of secure multiparty computation. In contrast with comparatively more works on privacy-preserving data-query in database, only few works deal with provably-secure privacy-preserving data manipulations, among which the join operator is the most powerful in generating new data (relation). We propose a very general cryptographic protocol framework for secure 2-party join computation based on anonymous IBE (identity-based encryption) scheme and its user private-keys blind generation techniques. This construction is provably GUC (generalized universally composable) secure in standard model with acceptable efficiency. In addition, an efficient instantiation based-on the anonymous Boyen-Waters IBE scheme is presented which user private-key’s blind generation protocol may be of independent values.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation and Analysis of Join Algorithms to handle skew for the Hadoop Map/Reduce Framework

he Map/Reduce framework-a parallel processing paradigm-is widely being used for large scale distributed data processing. Map/Reduce can perform typical relational database operations like selection, aggregation, and projection etc. However, binary relational operators like join, cartesian product, and set operations are difficult to implement with Map/Reduce. Map/Reduce can process homogeneous ...

متن کامل

A study of nested-relational joins in mediator-based distributed environments

This thesis reports on the results of a study of the nested join operator in a mediator-based setting. As the rate at which data is accumulated increases, the need for integration of di erent (physical) Database Management Systems (DBMS) becomes apparent. The most fundamental and arguably important operation that is used in order to achieve this is the join-operator. The nested-relational model...

متن کامل

Efficient Index-based Processing of Join Queries in DHTs

Massively distributed applications require the integration of heterogeneous data from multiple sources. Peer-to-peer (P2P) is one possible network model for these distributed applications and among P2P architectures, distributed hash table (DHT) is well known for its routing performance guarantees. Under a general distributed relational data model, join query operator, an essential component to...

متن کامل

Exploiting Spatial Indexes for Semijoin-Based Join Processing in Distributed Spatial Databases

ÐIn a distributed spatial database system, a user may issue a query that relates two spatial relations not stored at the same site. Because of the sheer volume and complexity of spatial data, spatial joins between two spatial relations at different sites are expensive in terms of computation and transmission cost. In this paper, we address the problems of processing spatial joins in a distribut...

متن کامل

A Wider Concept for Similarity Joins

Join is one of the most studied and employed retrieval operators made available by the modern relational database management systems (RDBMSs). This binary operator is algebraically defined as a Cartesian product followed by the selection operator that specifies the join condition. In modern RDBMS, the join condition employs comparison operators based both on equality and on the Total Ordering R...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009